Reconstruct the Logical Network from the Transition Matrix

نویسندگان

  • Cailu Wang
  • Yuegang Tao
چکیده

Reconstructing the logical network from the transition matrix is benefit for learning the logical meaning of the algebraic result from the algebraic representation of a BN. And so far there has no method to convert the matrix expression back to the logic expression for a BN with an arbitrary topology structure. Based on the canonical form and Karnaugh map, we propose a method for reconstructing the logical network from the transition matrix of a Boolean network in this paper.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Formal Petri Net Based Model for Antivirus Update Agent System

In this paper, a formal model for antivirus update agent system is presented based on mobile agent technology and predicate/transition Petri nets. The mobile agent system contains two mobile agents called DCA and UNA. It sends out agents to update antivirus on client computers in a network. Each agent takes on a specified responsibility. First, DCA roams through the network and check the last d...

متن کامل

A Formal Petri Net Based Model for Antivirus Update Agent System

In this paper, a formal model for antivirus update agent system is presented based on mobile agent technology and predicate/transition Petri nets. The mobile agent system contains two mobile agents called DCA and UNA. It sends out agents to update antivirus on client computers in a network. Each agent takes on a specified responsibility. First, DCA roams through the network and check the last d...

متن کامل

An improved algorithm to reconstruct a binary tree from its inorder and postorder traversals

It is well-known that, given inorder traversal along with one of the preorder or postorder traversals of a binary tree, the tree can be determined uniquely. Several algorithms have been proposed to reconstruct a binary tree from its inorder and preorder traversals. There is one study to reconstruct a binary tree from its inorder and postorder traversals, and this algorithm takes running time of...

متن کامل

Investigating the Effect of Ultrasonification Time on Transition from Monolithic Porous Network to Size-Tunable Monodispersed Silica Nanospheres via Stöber Method

Abstract Uniform colloidal monodispersed silica nanoparticles were synthesized via stöber method using ammonia as a basic catalyst. Field Emission Scanning Electron Microscope (FESEM) was confirmed the homogeneous nanospheres. The decrease of TEOS concentration (0.067 to 0.012 mol L-1) and an increase of H2O concentration (3 to 14 mol L-1) at 14 mol L-1 NH3 fixed accelerated the rate of h...

متن کامل

The Exact Solution of Min-Time Optimal Control Problem in Constrained LTI Systems: A State Transition Matrix Approach

In this paper, the min-time optimal control problem is mainly investigated in the linear time invariant (LTI) continuous-time control system with a constrained input. A high order dynamical LTI system is firstly considered for this purpose. Then the Pontryagin principle and some necessary optimality conditions have been simultaneously used to solve the optimal control problem. These optimality ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1710.09681  شماره 

صفحات  -

تاریخ انتشار 2017